On classical Clifford theory

On Clifford Theory of Vertex Operator Algebras

Classical simulation complexity of extended Clifford circuits

Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations can be classically efficiently simulated but this is true only in a suitably restricted setting. Here we consider Clifford computations with a variety of additional ingredients: (a) strong vs. weak simulation, (b) inp...

Clifford Theory for Cocentral Extensions

The classical Clifford correspondence for normal subgroups is considered in the more general setting of semisimple Hopf algebras. We prove that this correspondence still holds if the extension determined by the normal Hopf subalgebra is cocentral.

Analysis of Multiple Choice Questions Based On Classical Test Theory

Introduction: The aim of this study was to use Classical Test Theory (CTT) software for qualitative and quantitative analysis of Multiple Choice Questions (MCQ) for Master students of health discipline. Methods: This study was carried out on two groups each including 50 undergraduate students of public health, and two groups of 50 and 26 undergraduate students of occupational health. The final...

Clifford Theory for Association Schemes

Clifford theory of finite groups is generalized to association schemes. It shows a relation between irreducible complex characters of a scheme and a strongly normal closed subset of the scheme. The restriction of an irreducible character of a scheme to a strongly normal closed subset coniatns conjugate characters with same multiplicities. Moreover some strong relations are obtained.